A Multilevel Preconditioner for Domain Decomposition Boundary Systems
نویسندگان
چکیده
In this note, we consider multilevel preconditioning of the reduced boundary systems which arise in non-overlapping domain decomposition methods. It will be shown that the resulting preconditioned systems have condition numbers which are bounded in the case of multilevel spaces on the whole domain and grow at most proportional to the number of levels in the case of multilevel boundary spaces without multilevel extensions into the interior.
منابع مشابه
Some Estimates for a Weighted L2 Projection
This paper is devoted to the error estimates for some weighted L projections. Nearly optimal estimates are obtained. These estimates can be applied to the analysis of the usual multigrid method, multilevel preconditioner and domain decomposition method for solving elliptic boundary problems whose coefficients have large jump discontinuities.
متن کاملBILUTM: A Domain-Based Multilevel Block ILUT Preconditioner for General Sparse Matrices
This paper describes a domain-based multilevel block ILU preconditioner (BILUTM) for solving general sparse linear systems. This preconditioner combines a high accuracy incomplete LU factorization with an algebraic multilevel recursive reduction. Thus, in the first level the matrix is permuted into a block form using (block) independent set ordering and an ILUT factorization for the reordered m...
متن کاملA Domain Decomposition Preconditioner Based on a Change to a Multilevel Nodal Basis
A domain decomposition method based on a simple change of basis on the interfaces and vertices is presented. It is shown that this leads to an effective preconditioner compared to the ones previously considered, such as the preconditioner by Bramble, Pasciak, and Schatz (BPS) [Math. Comp., 47 (1986), pp. 103-134], and the hierarchical basis domain decomposition (HBDD) preconditioner by Smith an...
متن کاملCombining Multilevel Preconditioners with Domain Decomposition for Solving Linear Systems
Algebraic multilevel techniques for defining preconditioners have proven to bevery effective when used with Krylov methods. In most cases, they can solvelinear systems arising from the dicretization of PDEs with a number of floatingpoint operations proportional to the number of unknowns. To be efficient onparallel computers these multilevel techniques must use parallel smoothers...
متن کاملRobust Parameter-Free Multilevel Methods for Neumann Boundary Control Problems
We consider a linear-quadratic elliptic control problem (LQECP). For the problem we consider here, the control variable corresponds to the Neumann data on the boundary of a convex polygonal domain. The optimal control unknown is the one for which the harmonic extension approximates best a specified target in the interior of the domain. We propose multilevel preconditioners for the reduced Hessi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991